Constraint isomorphism and correction algorithms for violations
نویسندگان
چکیده
When a problem can be characterized by different parameter sets, constraints imposed on one parameter set must be consistent with, or isomorphic to, constraints imposed on other parameter sets. When mapping among the parameter sets is not so visibly obvious, one might overlook consistency violations, which have occurred in the past. This paper examines such violations and possible correction algorithms.
منابع مشابه
SEQUENTIAL PENALTY HANDLING TECHNIQUES FOR SIZING DESIGN OF PIN-JOINTED STRUCTURES BY OBSERVER-TEACHER-LEARNER-BASED OPTIMIZATION
Despite comprehensive literature works on developing fitness-based optimization algorithms, their performance is yet challenged by constraint handling in various engineering tasks. The present study, concerns the widely-used external penalty technique for sizing design of pin-jointed structures. Observer-teacher-learner-based optimization is employed here since previously addressed by a number ...
متن کاملOn the optimal correction of inconsistent matrix equations $AX = B$ and $XC = D$ with orthogonal constraint
This work focuses on the correction of both the coecient and the right hand side matrices of the inconsistent matrix equations $AX = B$ and $XC = D$ with orthogonal constraint. By optimal correction approach, a general representation of the orthogonal solution is obtained. This method is tested on two examples to show that the optimal correction is eective and highly accurate.
متن کاملThree Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملA Global Constraint for Graph Isomorphism Problems
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very straightforward way, so that one can use constraint programming to solve it. However, constraint programming is a generic tool that may be less efficient than dedicated algorithms which can take advantage of the global sem...
متن کاملOptimal Combined and Adaptive Protection of Active Distribution Networks Considering Different System Topologies Incorporating Optimal Selection of Standard Relay Curves
The change in the topology of active distribution networks (ADNs) is one of the essential challenges that might affect the protection schemes. The conventional protection schemes based on base topology result in some coordination constraint violations in other topologies due to the outage of upstream substations and distributed generation units. In this article, new combinational and adaptive p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008